Graph Fusion in Reciprocal Recommender Systems

نویسندگان

چکیده

Unlike traditional user-item recommendation tasks (e.g., movie or consumer-product recommendation), reciprocal recommender systems (RRSs) online dating services and job-recruitment sites) must consider the interests of both two users. Pair matching prediction can improve efficiency with which RRSs match potential partners. Graph Neural Networks (GNNs) are powerful models for learning representations attributed graphs information circulation between nodes. GNNs greatly facilitate link in area but have not been extensively applied to RRS. In this study, we present a novel method pair that learns users: only side about them also structural their behavior histories. contrast earlier RRSs, focus on response prediction, ours predicts send reply signals. Moreover, introduce negative sample mining explore effect different types multiple samples accuracy real applications. Testing our data provided by an service, achieved AUC 73.15% (an absolute improvement over 3.20% point above baseline) AP 26.01% 2.79%) prediction; 68.95% 1.74%) 23.02% 0.70%) 71.26% (over 4.35% improvement) 23.95% 0.30% fusion prediction.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning with Heterogeneous Side Information Fusion for Recommender Systems

Recommender System (RS) is a hot area where artificial intelligence (AI) techniques can be effectively applied to improve performance. Since the wellknown Netflix Challenge, collaborative filtering (CF) has become the most popular and effective recommendation method. Despite their success in CF, various AI techniques still have to face the data sparsity and cold start problems. Previous works t...

متن کامل

A graph model for E-commerce recommender systems

Information overload on the Web has created enormous challenges to customers selecting products for online purchases and to online businesses attempting to identify customers’ preferences efficiently. Various recommender systems employing different data representations and recommendation methods are currently used to address these challenges. In this research, we developed a graph model that pr...

متن کامل

RDF Graph Embeddings for Content-based Recommender Systems

Linked Open Data has been recognized as a useful source of background knowledge for building content-based recommender systems. Vast amount of RDF data, covering multiple domains, has been published in freely accessible datasets. In this paper, we present an approach that uses language modeling approaches for unsupervised feature extraction from sequences of words, and adapts them to RDF graphs...

متن کامل

Jumping Connections: A Graph-Theoretic Model for Recommender Systems

Recommender systems have become paramount to customize information access and reduce information overload. They serve multiple uses, ranging from suggesting products and artifacts (to consumers), to bringing people together by the connections induced by (similar) reactions to products and services. This thesis presents a graph-theoretic model that casts recommendation as a process of ‘jumping c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3239785